Weak Sequential Completeness of $\b$-Duals
نویسندگان
چکیده
منابع مشابه
The incompleteness of weak duals
1. Incompleteness of weak duals of reasonable spaces 2. Appendix: locally-convex limits and colimits 3. Appendix: ubiquity of quasi-completeness The point here is to prove that the weak duals of reasonable topological vector spaces, such as infinite-dimensional Hilbert, Banach, or Fréchet spaces, are not complete. That is, in these weak duals there are Cauchy nets which do not converge. Happily...
متن کاملStrict Sequential P-completeness
In this paper we present a new notion of what it means for a problem in P to be inherently sequential. Informally, a problem L is strictly sequential P-complete if when the best known sequential algorithm for L has polynomial speedup by parallelization, this implies that all problems in P have a polynomial speedup in the parallel setting. The motivation for defining this class of problems is to...
متن کاملSequential Completeness of Inductive Limits
A regular inductive limit of sequentially complete spaces is sequentially complete. For the converse of this theorem we have a weaker result: if indEn is sequentially complete inductive limit, and each constituent space En is closed in indEn, then indEn is α-regular.
متن کاملCompleteness and Weak Completeness Under Polynomial-Size Circuits
This paper investigates the distribution and nonuniform complexity of problems that are com plete or weakly complete for ESPACE under nonuniform reductions that are computed by polynomial size circuits P Poly Turing reductions and P Poly many one reductions A tight exponential lower bound on the space bounded Kolmogorov complexities of weakly P Poly Turing complete problems is established A Sma...
متن کاملWeak Completeness of Coalgebraic Dynamic Logics
We present a coalgebraic generalisation of Fischer and Ladner’s Propositional Dynamic Logic (PDL) and Parikh’s Game Logic (GL). In earlier work, we proved a generic strong completeness result for coalgebraic dynamic logics without iteration. The coalgebraic semantics of such programs is given by a monad T , and modalities are interpreted via a predicate lifting λ whose transpose is a monad morp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rocky Mountain Journal of Mathematics
سال: 1996
ISSN: 0035-7596
DOI: 10.1216/rmjm/1181072004